Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find
نویسنده
چکیده
Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed nonorientable P-irreducible 3-manifolds that can be formed from at most ten tetrahedra.
منابع مشابه
Face Pairing Graphs and 3-manifold Enumeration
The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P-irreducible triangulation. In addition we present constraints upon the combinatorial structure of such a triangulation that can be deduced from its face...
متن کاملIsomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
We present a fast enumeration algorithm for combinatorial 2and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all equivelar maps on the non-orientable surface of genus 4 as well as all equivelar triangulations of the orientable surface of genus 3 and the non-orientable surfaces of...
متن کاملTwisted Face-pairing 3-manifolds
This paper is an enriched version of our introductory paper on twisted face-pairing 3-manifolds. Just as every edge-pairing of a 2-dimensional disk yields a closed 2-manifold, so also every face-pairing of a faceted 3ball P yields a closed 3-dimensional pseudomanifold. In dimension 3, the pseudomanifold may suffer from the defect that it fails to be a true 3-manifold at some of its vertices. Th...
متن کاملEnumerating 2-cell Imbeddings of Connected Graphs
A systematic approach is developed for enumerating congruence classes of 2-cell imbeddings of connected graphs on closed orientable 2-manifolds. The method is applied to the wheel graphs and to the complete graphs. Congruence class genus polynomials and congruence class imbedding polynomials are introduced, to summarize important information refining the enumeration.
متن کاملLIU INTRODUCTORY MAP THEORY Kapa & Omega , Glendale , AZ USA 2010
A Smarandache system (Σ;R) is such a mathematical system with at leastone Smarandachely denied rule r in R such that it behaves in at least two different wayswithin the same set Σ, i.e., validated and invalided, or only invalided but in multiple dis-tinct ways. A map is a 2-cell decomposition of surface, which can be seen as a connectedgraphs in development from partition to per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 38 شماره
صفحات -
تاریخ انتشار 2007